Direction of Arrival and the Rank-revealing Urv Decomposition Direction of Arrival and the Rank-revealing Urv Decomposition
نویسندگان
چکیده
In many practical direction-of-arrival (DOA) problems the number of sources and their directions from an antenna array do not remain stationary. Hence a practical DOA algorithm must be able to track changes with a minimal number of snapshots. In this paper we describe DOA algorithms, based on a new decomposition, that are not expensive to compute or diicult to update. The algorithms are compared with algorithms based on the singular value decomposition (SVD). ABSTRACT In many practical direction-of-arrival (DOA) problems the number of sources and their directions from an antenna array do not remain stationary. Hence a practical DOA algorithm must be able to track changes with a minimal number of snapshots. In this paper we describe DOA algorithms, based on a new decomposition, that are not expensive to compute or diicult to update. The algorithms are compared with algorithms based on the singular value decomposition (SVD).
منابع مشابه
URV ESPRIT for tracking time-varying signals
AbstructESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Unfortunately, its computational burden makes it unsuitable for real time processing of signals with time-varying directions of arrival. In this work we develop a new implementation of ESPRIT that has potential for real time processing. It is based on a rank-reve...
متن کاملAn Adaptive ESPRIT Based on URV Decomposition*
ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at am array of sensors. Unfortunately, its computational burden & it unsuitable for real time processing of signals with time-varying directions of arrival. In this work we develop a new implementation of ESPRIT that has potential for real time processing. It is based on a rank-revealing UFW de...
متن کاملA Wavefront Array for IJRV Decomposition Updating
The rank revealing URV decomposition is a useful tool in many signal processing applications that require the computation of the noise subspace of a matrix. In this paper, we look at the problem of updating the URV decomposition arid consider its implementation on a wavefront array. We prlopose a wavefront array for efficient VLSI implementation of the URV decomposition. The array provides a me...
متن کاملComputing Symmetric Rank-Revealing Decompositions via Triangular Factorization
We present a family of algorithms for computing symmetric rank-revealing VSV decompositions, based on triangular factorization of the matrix. The VSV decomposition consists of a middle symmetric matrix that reveals the numerical rank in having three blocks with small norm, plus an orthogonalmatrix whose columns span approximations to the numerical range and null space. We show that for semi-de ...
متن کامل